const runtime.bitScan

33 uses

	runtime (current package)
		mbitmap.go#L57: 	bitScan    = 1 << 4
		mbitmap.go#L63: 	bitScanAll    = bitScan | bitScan<<heapBitsShift | bitScan<<(2*heapBitsShift) | bitScan<<(3*heapBitsShift)
		mbitmap.go#L531: 	return h.bits()&bitScan != 0
		mbitmap.go#L836: 		mask1 = bitPointer | bitScan                        // 00010001
		mbitmap.go#L837: 		mask2 = bitPointer | bitScan | mask1<<heapBitsShift // 00110011
		mbitmap.go#L838: 		mask3 = bitPointer | bitScan | mask2<<heapBitsShift // 01110111
		mbitmap.go#L888: 				*h.bitp &^= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
		mbitmap.go#L889: 				*h.bitp |= (bitPointer | bitScan) << h.shift
		mbitmap.go#L892: 				*h.bitp |= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
		mbitmap.go#L906: 		hb |= bitScanAll & ((bitScan << (typ.ptrdata / goarch.PtrSize)) - 1)
		mbitmap.go#L909: 		*h.bitp &^= (bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << h.shift
		mbitmap.go#L945: 		hb |= bitScan
		mbitmap.go#L947: 		hb |= hb & (bitScan << (2 * heapBitsShift)) >> 1
		mbitmap.go#L1203: 		hb |= bitScan << (2 * heapBitsShift)
		mbitmap.go#L1205: 			hb |= bitScan << (3 * heapBitsShift)
		mbitmap.go#L1209: 		*hbitp &^= uint8((bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << (2 * heapBitsShift))
		mbitmap.go#L1327: 		*hbitp = *hbitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | uint8(hb)
		mbitmap.go#L1354: 			*h.bitp = *h.bitp&^((bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift)<<(2*heapBitsShift)) | *src
		mbitmap.go#L1380: 			*h.bitp = *h.bitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | *src
		mbitmap.go#L1437: 			have = (*h.bitp >> h.shift) & (bitPointer | bitScan)
		mbitmap.go#L1442: 					want = bitScan
		mbitmap.go#L1448: 				want |= bitScan
		mgcmark.go#L1293: 		if bits&bitScan == 0 {